Farthest-Polygon Voronoi Diagrams
نویسندگان
چکیده
Given a family of k disjoint connected polygonal sites in general position and of total complexity n, we consider the farthest-site Voronoi diagram of these sites, where the distance to a site is the distance to a closest point on it. We show that the complexity of this diagram is O(n), and give an O(n log n) time algorithm to compute it. We also prove a number of structural properties of this diagram. In particular, a Voronoi region may consist of k − 1 connected components, but if one component is bounded, then it is equal to the entire region.
منابع مشابه
Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon
Given a set of sites in a simple polygon, a geodesic Voronoi diagram partitions the polygon into regions based on distances to sites under the geodesic metric. We present algorithms for computing the geodesic nearest-point, higher-order and farthest-point Voronoi diagrams of m point sites in a simple n-gon, which improve the best known ones form ≤ n/polylogn. Moreover, the algorithms for the ne...
متن کاملVoronoi Diagram for Convex Polygonal Sites with Convex Polygon-Offset Distance Function
The concept of convex polygon-offset distance function was introduced in 2001 by Barequet, Dickerson, and Goodrich. Using this notion of point-to-point distance, they showed how to compute the corresponding nearestand farthest-site Voronoi diagram for a set of points. In this paper we generalize the polygon-offset distance function to be from a point to any convex object with respect to an m-si...
متن کاملThe Geodesic Farthest-point Voronoi Diagram in a Simple Polygon
Given a set of point sites in a simple polygon, the geodesic farthest-point Voronoi diagram partitions the polygon into cells, at most one cell per site, such that every point in a cell has the same farthest site with respect to the geodesic metric. We present an O(n log log n+m logm)time algorithm to compute the geodesic farthest-point Voronoi diagram of m point sites in a simple n-gon. This i...
متن کاملHigher-Order Geodesic Voronoi Diagrams in a Polygonal Domain with Holes
We investigate the higher-order Voronoi diagrams of n point sites with respect to the geodesic distance in a simple polygon with h > 0 polygonal holes and c corners. Given a set of n point sites, the korder Voronoi diagram partitions the plane into several regions such that all points in a region share the same k nearest sites. The nearest-site (first-order) geodesic Voronoi diagram has already...
متن کاملThe Farthest-Point Geodesic Voronoi Diagram of Points on the Boundary of a Simple Polygon
Given a set of sites (points) in a simple polygon, the farthest-point geodesic Voronoi diagram partitions the polygon into cells, at most one cell per site, such that every point in a cell has the same farthest site with respect to the geodesic metric. We present an O((n + m) log logn)time algorithm to compute the farthest-point geodesic Voronoi diagram for m sites lying on the boundary of a si...
متن کامل